Enumerating building block semantics in genetic programming
نویسندگان
چکیده
This report provides a collection of definitions for the semantics of subtrees and contexts as manipulated by standard sub-tree crossover in genetic programming (GP). These definitions allow us to completely and compactly describe the exact semantics of the components manipulated by sub-tree crossover, and the semantic results of those interactions. Subsequent work shows how these definitions can be used to collect valuable data about the available diversity in a GP population and the opportunities available to sub-tree crossover.
منابع مشابه
Genetic Programming Bloat without Semantics
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype). GP populations are evolved on both random problems and problems with “building blocks”. These are compared to problems with explicit ineffective code (introns, junk code, inviable code). Our results suggest the entr...
متن کاملRedundancy and its forms in the last third of the Holy Quran
Recognizing the rhetoric sciences plays an important role in understanding facetiae and minutes of the Qur'an. One of the subdirectories of the semantics is "brevity, redundant and equality" that has long been of interest to scholars of rhetoric, so that some scholar experts have been confined rhetoric to this discussion. Therefore in enumerating types of brevity, redundant and equality differe...
متن کاملApplication of Genetic Programming to Modeling and Prediction of Activity Coefficient Ratio of Electrolytes in Aqueous Electrolyte Solution Containing Amino Acids
Genetic programming (GP) is one of the computer algorithms in the family of evolutionary-computational methods, which have been shown to provide reliable solutions to complex optimization problems. The genetic programming under discussion in this work relies on tree-like building blocks, and thus supports process modeling with varying structure. In this paper the systems containing amino ac...
متن کاملThe Building Block Basis for Genetic Programming and Variable-length Genetic Algorithms
The Building Block Basis (BBB) has recently been shown to be extremely useful in characterising the dynamics of genetic algorithms operating on fixed-length strings. In this paper we show that there is a natural generalisation of the BBB for variable-length strings and program trees.
متن کاملA Simple Semantics for Polymorphic Recursion
Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of efficient algorithms that take advantage of non-uniform data structures and provides key support for generic programming. However, polymorphic recursion is, perhaps, not as broadly understood as it could be and this, in part, m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007